On The Portability Of Complex Constraint-Based Grammars
نویسندگان
چکیده
]{.ec('.nt years have seen tile appearance of' a number of g r a m m a r f 'ormalisms 1 shar ing a s t rong family resemblance, which we have character ised elsewhere [R,upp et al., 199d] as tim proper ty of being constraint-based. As well as having in common many formal properties, these formal isms also suppor t , of ten by explicit de.sign, descr ipt ions from a similarly convergent range o[' l inguistic theories, which we might reasonably label " [ lPSG-l ike" .
منابع مشابه
Multilingual Question Answering With High Portability On Relational Databases
This paper describes a highly-portable multilingual question answering system on multiple relational databases. We apply semantic category and pattern-based grammars, into natural language interfaces to relational databases. Lexico-semantic pattern (LSP) and multi-level grammars achieve portability of languages, domains, and DBMSs. The LSP-based linguistic processing does not require deep analy...
متن کاملA Framework for Constraint-based Modeling
We propose a framework that provides a clear process and well-developed semantics for modeling complex systems using a constraint-based language. We describe the aspects of a model that are captured by a constraint-based representation, in terms of function-based and process-based modeling approaches. We propose a formal framework for building constraint-based models, and apply graph grammars t...
متن کاملTowards Domain-Independent Deep Linguistic Processing: Ensuring Portability and Re-Usability of Lexicalised Grammars
In this paper we illustrate and underline the importance of making detailed linguistic information a central part of the process of automatic acquisition of large-scale lexicons as a means for enhancing robustness and at the same time ensuring maintainability and re-usability of deep lexicalised grammars. Using the error mining techniques proposed in (van Noord, 2004) we show very convincingly ...
متن کاملQuantitative Constraint Logic Programming for Weighted Grammar Applications
Constraint logic grammars provide a powerful formalism for expressing complex logical descriptions of natural language phenomena in exact terms. Describing some of these phenomena may, however, require some form of graded distinctions which are not provided by such grammars. Recent approaches to weighted constraint logic grammars attempt to address this issue by adding numerical calculation sch...
متن کاملConstraint Relation Multiset Grammars for Visual Languages
This paper proposes grammars for visual languages. The proposed grammars introduce relations into the constraint multiset grammars[4J. Relations are the constraints on the relationships among symbols in visual languages. The proposed grammars. which are called constraint relation multiset grammars. have the relations as the first class citizens of the grammars because the relationships among sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994